Uniformly best constant risk and minimax point estimates
نویسندگان
چکیده
منابع مشابه
Best-First Minimax Search
We describe a very simple selective search algorithm for two-player games, called best-first minimax. It always expands next the node at the end of the expected line of play, which determines the minimax value of the root. It uses the same information as alpha-beta minimax, and takes roughly the same time per node generation. We present an implementation of the algorithm that reduces its space ...
متن کاملThe Norm Estimates of Pre-Schwarzian Derivatives of Spirallike Functions and Uniformly Convex $alpha$-spirallike Functions
For a constant $alphain left(-frac{pi}{2},frac{pi}{2}right)$, we definea subclass of the spirallike functions, $SP_{p}(alpha)$, the setof all functions $fin mathcal{A}$[releft{e^{-ialpha}frac{zf'(z)}{f(z)}right}geqleft|frac{zf'(z)}{f(z)}-1right|.]In the present paper, we shall give the estimate of the norm of the pre-Schwarzian derivative $mathrm{T}...
متن کاملEmpirical Entropy, Minimax Regret and Minimax Risk
We consider the random design regression with square loss. We propose a method that aggregates empirical minimizers (ERM) over appropriately chosen random subsets and reduces to ERM in the extreme case, and we establish exact oracle inequalities for its risk. We show that, under the −p growth of the empirical -entropy, the excess risk of the proposed method attains the rate n− 2 2+p for p ∈ (0,...
متن کاملBest-First Minimax Search: First Results
We present a very simple selective minimax search algorithm for two-player gaines. It ahvays expands next the frontier node at the end of the principal variation, or current best line of play, which is the node that determines the minimax value of the root. The algorithm requires no information other than a static evaluation function, and its time overhead per node is similar to that of alpha-b...
متن کاملParallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering’s best-first search. Randomization both fixes a defect in the original algorithm and introduces significant parallelism. An experimental evaluation demonstrates that the algorithm is efficient (in terms of the number of search-tree vertices that it visits) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Research of the National Bureau of Standards
سال: 1952
ISSN: 0091-0635
DOI: 10.6028/jres.048.004